Analyzing lock contention in multithreaded applications
نویسندگان
چکیده
منابع مشابه
Portable Tracing of Lock Contention in Java Applications
Concurrent programming has become necessary to benefit from current multi-core processors. The main challenge is safely accessing shared resources from multiple parallel threads, which is typically done with locks. Simple locking mechanisms are easier to implement correctly, but often suffer from high lock contention, which means that threads frequently have to wait until another thread release...
متن کاملForecasting Lock Contention Before Adopting Another Lock Algorithm
Locks are often used in parallel applications to ensure correct behavior, but frequently induce performance bottlenecks caused by contention at frequently accessed locks. There are state-of-the-art locking algorithms, whose performance under high contention is superior to that of the most commonly used ones. However, some of these have a different interface, and adopting them incurs a reimpleme...
متن کاملContention-Aware Lock Scheduling for Transactional Databases
Lock managers are among the most studied components in concurrency control and transactional systems. However, one question seems to have been generally overlooked: “When there are multiple lock requests on the same object, which one(s) should be granted first?” Nearly all existing systems rely on a FIFO (first in, first out) strategy to decide which transaction(s) to grant the lock to. In this...
متن کاملDurability Semantics for Lock-based Multithreaded Programs
Non-volatile storage connected as memory (NVRAM) offers promising opportunities for simplifying and accelerating manipulation of persistent data. Load and store latency is potentially comparable to that of ordinary memory. The challenge is to ensure that the persisted data remains consistent if a failure occurs during execution, especially in a multithreaded programming environment. In this pap...
متن کاملPredicting the cost of lock contention in parallel applications on multicores using analytic modeling
The scalability of a parallel program is limited by several factors, such as the size of its non-parallelizable fraction, the amount of contention for shared resources, the cost of synchronization, etc. We consider the problem of predicting the cost of contention for shared locks. We propose a way to address this problem with analytical techniques using queueing network models. Analytical model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2010
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1837853.1693489